Offset-polygon annulus placement problems
نویسندگان
چکیده
منابع مشابه
Offset-Polygon Annulus Placement Problems
r down tò 2 , it is a weakly monotone increasing function. But in a monotone function, a value can only appear once (or in one continuous range). Since the function is divided into two weakly monotone regions, a xed value can appear at most twice (or in two continuous ranges). This suuces to show that there can be at most two intersections between (I r) and O r , one in each weakly monotone reg...
متن کاملOoset-polygon Annulus Placement Problems ?
In this paper we address several variants of the polygon an-nulus placement problem: given an input polygon P and a set S of points, nd an optimal placement of P that maximizes the number of points in S that fall in a certain annulus region deened by P and some ooset distance > 0. We address the following variants of the problem: placement of a convex polygon as well as a simple polygon; placem...
متن کاملOptimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of points in S. We present two solutions to this problem that represent time versus space tradeoffs. The first algorithm runs in O(n3m3) expected time using O(n2m2) space. The second algorithm runs in O(n3m3 log(nm)) det...
متن کاملVoronoi Diagrams for Polygon-Offset Distance Functions
In this paper we develop the concept of a polygon-ooset distance function and show how to compute the respective nearest-and furthest-site Voronoi diagrams of point sites in the plane. We provide optimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for computing compact representations of both diagrams.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(98)00025-x